全文获取类型
收费全文 | 225篇 |
免费 | 45篇 |
国内免费 | 8篇 |
出版年
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 6篇 |
2020年 | 8篇 |
2019年 | 3篇 |
2018年 | 2篇 |
2017年 | 6篇 |
2016年 | 4篇 |
2015年 | 7篇 |
2014年 | 18篇 |
2013年 | 19篇 |
2012年 | 11篇 |
2011年 | 10篇 |
2010年 | 13篇 |
2009年 | 18篇 |
2008年 | 15篇 |
2007年 | 22篇 |
2006年 | 11篇 |
2005年 | 9篇 |
2004年 | 3篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 8篇 |
2000年 | 7篇 |
1999年 | 8篇 |
1998年 | 11篇 |
1997年 | 4篇 |
1996年 | 6篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 6篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1982年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有278条查询结果,搜索用时 31 毫秒
251.
我国光电火控系统亟待解决的问题 总被引:5,自引:2,他引:3
介绍了光电跟踪器的优点 ,分析了我国目前光电跟踪器的现状 ,从装备发展的角度指出了光电跟踪器及光电火控系统亟待解决的科研课题 相似文献
252.
253.
We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance. 相似文献
254.
255.
256.
257.
We consider the multitasking scheduling problem on unrelated parallel machines to minimize the total weighted completion time. In this problem, each machine processes a set of jobs, while the processing of a selected job on a machine may be interrupted by other available jobs scheduled on the same machine but unfinished. To solve this problem, we propose an exact branch‐and‐price algorithm, where the master problem at each search node is solved by a novel column generation scheme, called in‐out column generation, to maintain the stability of the dual variables. We use a greedy heuristic to obtain a set of initial columns to start the in‐out column generation, and a hybrid strategy combining a genetic algorithm and an exact dynamic programming algorithm to solve the pricing subproblems approximately and exactly, respectively. Using randomly generated data, we conduct numerical studies to evaluate the performance of the proposed solution approach. We also examine the effects of multitasking on the scheduling outcomes, with which the decision maker can justify making investments to adopt or avoid multitasking. 相似文献
258.
提出了反舰导弹武器系统作战效能评估风险的概念,分析了反舰导弹武器系统作战效能评估中存在的不确定因素和反舰导弹武器系统作战效能评估风险的来源,探讨了反舰导弹武器系统作战效能评估风险的控制与缩减方法。 相似文献
259.
基于计算机三维建模技术的两栖车辆静水性能计算 总被引:4,自引:1,他引:3
为了解决传统静水性能计算中倾斜浮态下浮心计算困难的问题,建立了两栖车辆的三维实体模型,研究了任意浮态下浮心的计算方法。在此基础上,求解了两栖车辆在静水平衡时的浮态,并利用SolidWorks提供的API函数进行二次开发,实现了计算的自动化。经实例验证表明,该算法准确、快速。 相似文献
260.
This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献